Decoding the Mathieu group M12

نویسندگان

  • Robert F. Bailey
  • John Bray
چکیده

We show how to use the elements of a sharply k-transitive permutation group of degree n to form error-correcting codes, as suggested by Blake [1], presenting suitable decoding algorithms for these codes. In particular, we concentrate on using the Mathieu group M12 to form a (12,95040,8)-code to correct three errors. The algorithm we give for this code differs from that given by Cohen and Deza [2].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decoding the Mathieu Group

The sporadic Mathieu group M12 can be viewed as an errorcorrecting code, where the codewords are the group’s elements written as permutations in list form, and with the usual Hamming distance. We investigate the properties of this group as a code, in particular determining completely the probabilities of successful and ambiguous decoding of words with more than 3 errors (which is the number tha...

متن کامل

The Mathieu group M12 and its pseudogroup extension M13, Experiment

We study a construction of the Mathieu group M12 using a game reminiscent of Loyd’s “15-puzzle”. The elements of M12 are realized as permutations on 12 of the 13 points of the finite projective plane of order 3. There is a natural extension to a “pseudogroup” M13 acting on all 13 points, which exhibits a limited form of sextuple transitivity. Another corollary of the construction is a metric, a...

متن کامل

The Mathieu Group M 12 and Its Pseudogroup Extension

We study a construction of the Mathieu group M12 using a game reminiscent of Loyd’s “15-puzzle”. The elements of M12 are realized as permutations on 12 of the 13 points of the finite projective plane of order 3. There is a natural extension to a “pseudogroup” M13 acting on all 13 points, which exhibits a limited form of sextuple transitivity. Another corollary of the construction is a metric, a...

متن کامل

A combinatorial construction of an M12-invariant code

A ternary [66, 10, 36]3-code admitting the Mathieu group M12 as a group of automorphisms has recently been constructed by N. Pace, see [2]. We give a construction of the Pace code in terms of M12 as well as a combinatorial description in terms of the small Witt design, the Steiner system S(5, 6, 12). We also present a proof that the Pace code does indeed have minimum distance 36.

متن کامل

A 2-local Characterization of M12

A characterization of the Mathieu group M12 is established; the characterization is used by Aschbacher and Smith in their classification of the quasithin finite simple groups. This is one in a series of papers providing simplified, modern, computer free treatments of the existence and uniqueness of the sporadic groups, and of the normalizers of subgroups of prime order and Sylow subgroups in th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Adv. in Math. of Comm.

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2007